Two-dimensional descriptor systems
نویسندگان
چکیده
Linear descriptor systems are governed by dynamical equations subject to algebraic constraints. In the one-dimensional case, where only depend on a single index, usually time, Weierstrass canonical form splits up state vector in two parts, causal part, running forward and non-causal backward. this paper linear time-invariant autonomous two-dimensions discussed condition existence of non-trivial solution is derived, together with an explicit formula for output such systems. It shown that model can be related part each dimensions model, backward various respectively. The results obtained requiring solutions, states outputs, which defined two-dimensional grid, path invariant unique.
منابع مشابه
Two-Dimensional Principal Component Analysis with Local Direction Descriptor
This paper proposes a novel approach using two-dimensional principal component analysis (2D-PCA) and local direction descriptor for face recognition. The proposed method utilizes the transformed image obtained from local direction descriptor as the direct input image of 2D-PCA algorithms. The performance comparison was performed using principal component analysis (PCA) and Gabor-wavelets based ...
متن کاملSelf-similar solutions of the Riemann problem for two-dimensional systems of conservation laws
In this paper, a new approach is applied to study the self-similar solutions of 2×2 systems of nonlinear hyperbolic conservation laws. A notion of characteristic directions is introduced and then used to construct local and smooth solutions of the associated Riemann problem
متن کاملOptimal Control for Descriptor Systems: Tracking Problem (RESEARCH NOTE)
Singular systems have been studied extensively during the last two decades due Abstract to their many practical applications. Such systems possess numerous properties not shared by the well-known state variable systems. This paper considers the linear tracking problem for the continuous-time singular systems. The Hamilton-Jacobi theory is used in order to compute the optimal control and associa...
متن کاملPartial realization of descriptor systems
We address the partial realization problem for linear descriptor systems. A general solution to this problem using the Markov parameters of the system defined via its Laurent series is provided. For proper descriptor systems, we also discuss a numerically feasible algorithm for computing a partial minimal realization based on the unsymmetric Lanczos process. Applications to model reduction for ...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2021
ISSN: ['2405-8963', '2405-8971']
DOI: https://doi.org/10.1016/j.ifacol.2021.06.070